Leonidas Palios: search on Z-Library

The world's largest scientific articles store. 70,000,000+ articles for free.

Don't use scam websites

1

On the Strongly Connected and Biconnected Components of the Complement of Graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Electronic Notes in Discrete Mathematics

Year:

2004

Language:

english

File:

PDF, 172 KB

english, 2004

2

On the parallel computation of the biconnected and strongly connected co-components of graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Discrete Applied Mathematics

Year:

2007

Language:

english

File:

PDF, 313 KB

english, 2007

3

On the hamiltonicity of the cartesian product

Vassilios V. Dimakopoulos, Leonidas Palios, Athanasios S. Poulakidas

Journal:

Information Processing Letters

Year:

2005

Language:

english

File:

PDF, 115 KB

english, 2005

4

Join-Reachability Problems in Directed Graphs

Loukas Georgiadis, Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Theory of Computing Systems

Year:

2014

Language:

english

File:

PDF, 1.30 MB

english, 2014

5

Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments

Leonidas Palios

Journal:

Journal of Algorithms

Year:

1997

Language:

english

File:

PDF, 837 KB

english, 1997

6

Optimal tetrahedralization of the 3D-region “between” a convex polyhedron and a convex polygon

Leonidas Palios

Journal:

Computational Geometry

Year:

1996

Language:

english

File:

PDF, 995 KB

english, 1996

7

Editorial

Ioannis Z. Emiris, Leonidas Palios

Journal:

Computational Geometry

Year:

2008

Language:

english

File:

PDF, 57 KB

english, 2008

8

Efficient parallel recognition of cographs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Discrete Applied Mathematics

Year:

2005

Language:

english

File:

PDF, 375 KB

english, 2005

9

Minimal separators in -sparse graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Discrete Mathematics

Year:

2006

Language:

english

File:

PDF, 247 KB

english, 2006

10

Maximizing the number of spanning trees in -complements of asteroidal graphs

Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos

Journal:

Discrete Mathematics

Year:

2009

Language:

english

File:

PDF, 898 KB

english, 2009

11

Parallel algorithms for P4-comparability graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Journal of Algorithms

Year:

2004

Language:

english

File:

PDF, 355 KB

english, 2004

12

An efficient shape-based approach to image retrieval

Ioannis Fudos, Leonidas Palios

Journal:

Pattern Recognition Letters

Year:

2002

Language:

english

File:

PDF, 261 KB

english, 2002

13

Triangulating a nonconvex polytope

Bernard Chazelle, Leonidas Palios

Journal:

Discrete & Computational Geometry

Year:

1990

Language:

english

File:

PDF, 1.47 MB

english, 1990

14

An Optimal Parallel Co-Connectivity Algorithm

Ka Wong Chong, Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Theory of Computing Systems

Year:

2004

Language:

english

File:

PDF, 305 KB

english, 2004

15

Algorithms for P4-Comparability Graph Recognition and Acyclic P4-Transitive Orientation

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Year:

2004

Language:

english

File:

PDF, 413 KB

english, 2004

16

Detecting Holes and Antiholes in Graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Year:

2007

Language:

english

File:

PDF, 227 KB

english, 2007

17

Computing the Newton Polygon of the Implicit Equation

Ioannis Z. Emiris, Christos Konaxis, Leonidas Palios

Journal:

Mathematics in Computer Science

Year:

2010

Language:

english

File:

PDF, 530 KB

english, 2010

18

A fully dynamic algorithm for the recognition of -sparse graphs

Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 525 KB

english, 2012

19

An -time certifying algorithm for recognizing HHD-free graphs

Stavros D. Nikolopoulos, Leonidas Palios

Journal:

Theoretical Computer Science

Year:

2012

Language:

english

File:

PDF, 434 KB

english, 2012

20

An -time algorithm for the paired domination problem on permutation graphs

Evaggelos Lappas, Stavros D. Nikolopoulos, Leonidas Palios

Journal:

European Journal of Combinatorics

Year:

2013

Language:

english

File:

PDF, 334 KB

english, 2013

21

Counting spanning trees using modular decomposition

Nikolopoulos, Stavros D., Palios, Leonidas, Papadopoulos, Charis

Journal:

Theoretical Computer Science

Year:

2014

Language:

english

File:

PDF, 579 KB

english, 2014

22

Corrigendum to “Note on covering monotone orthogonal polygons” [Inf. Process. Lett. 104(6) (2007) 220–227]

Lingas, Andrzej, Palios, Leonidas, Wasylewicz, Agnieszka, Żyliński, Paweł

Journal:

Information Processing Letters

Year:

2014

Language:

english

File:

PDF, 669 KB

english, 2014

23

Parallel Algorithms for Recognizing P 5 -free and -free Weakly Chordal Graphs

Nikolopoulos, Stavros D., Palios, Leonidas

Journal:

Parallel Processing Letters

Year:

2004

Language:

english

File:

PDF, 699 KB

english, 2004

24

Encoding watermark numbers as reducible permutation graphs using self-inverting permutations

Chroni, Maria, Nikolopoulos, Stavros D., Palios, Leonidas

Journal:

Discrete Applied Mathematics

Year:

2018

Language:

english

File:

PDF, 631 KB

english, 2018

25

Capturing Points with a Rotating Polygon (and a 3D Extension)

Alegría-Galicia, Carlos, Orden, David, Palios, Leonidas, Seara, Carlos, Urrutia, Jorge

Journal:

Theory of Computing Systems

Year:

2018

Language:

english

File:

PDF, 1.96 MB

english, 2018

To build up a library is to create a life. It’s never just a random collection of books.

— Carlos María Domínguez

Official channel

Z-Library Desktop Launcher

Z-Library Since 2009 support@z-lib.do

EnglishРусскийEspañolItalianoελληνικάاللغة العربيةBahasa IndonesiaBahasa Malaysiaहिन्दीDeutschFrançaisPortuguêsУкраїнськаPolski中文繁體中文日本語Tiếng ViệtAzərbaycan DiliՀայոց լեզուภาษาไทยTürk Diliქართველიবাংলাپښتوతెలుగుاردو한국어SrpskiБългарски